Heq: A Coq library for Heterogeneous Equality
نویسنده
چکیده
We give an introduction to the library Heq, which provides a set of tactics to manipulate heterogeneous equality and explicit coercion, such as rewriting of heterogeneous equality and elimination and relocation of explicit coercions.
منابع مشابه
Alea: a library for reasoning on randomized algorithms in Coq
1 Misc.v: Preliminaries 5 1.1 De nition of iterator compn . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 6 1.2 Reducing if constructs . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 6 1.3 Classical reasoning . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 6 1.4 Extensional equality . . . ....
متن کاملExperience Implementing a Performant Category-Theory Library in Coq
We describe our experience implementing a broad categorytheory library in Coq. Category theory and computational performance are not usually mentioned in the same breath, but we have needed substantial engineering effort to teach Coq to cope with large categorical constructions without slowing proof script processing unacceptably. In this paper, we share the lessons we have learned about how to...
متن کاملVeriied Proofs concerning Functional Programs
In this paper the development of automatically veriied proofs for functional programs is examined. This examination is made on the basis of a small functional program written in the functional language clean. For this program a proof is constructed in the proof system coq. This proof is automatically veriied by coq. The functional program presented contains two function-constructors for the cla...
متن کاملSynthetic topology in Homotopy Type Theory for probabilistic programming
In the theory of programming languages, the use of proof assistants has become mainstream. It is considered good form to provide a formal connection between a language and its semantics. Currently, the main tools for this are based on either higher order logic, or on type theory. Here we will focus on Coq, the biggest system of the latter class. The ALEA [2] Coq library formalizes discrete meas...
متن کاملDisplayed Categories
We introduce and develop the notion of displayed categories. A displayed category over a category C is equivalent to ‘a category D and functor F : D → C’, but instead of having a single collection of ‘objects of D’ with a map to the objects of C, the objects are given as a family indexed by objects of C, and similarly for the morphisms. This encapsulates a common way of building categories in p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010